stream cipher algorithm - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

stream cipher algorithm - перевод на русский

SYMMETRIC KEY CIPHER WHERE PLAINTEXT DIGITS ARE COMBINED WITH A PSEUDORANDOM CIPHER DIGIT STREAM
Combiner-type algorithm; Stream ciphers; Self-synchronizing stream cipher; Streaming cipher; Stream Cipher; Additive cipher; Additive Cipher; Stream cypher; Self-synchronizing cipher; Draft:Metode stream chiper
  • Lorenz SZ cipher]] machine as used by the German military during World War II
Найдено результатов: 945
stream cipher algorithm      
алгоритм поточного шифрования
stream cipher         
поточный шифр
stream cipher         

общая лексика

поточный шифр, потоковый шифр

шифр, в котором исходное сообщение преобразуется в шифротекст побитово. Исторически в отечественной криптографии принято использовать термин "поточный шифр", хотя термин "потоковый шифр" нам представляется более адекватным

антоним

block cipher

self-synchronizing cipher         
самосинхронизирующий шифр, шифр с самосиихронизацией
Vigenere square         
  • Confederacy]]'s [[cipher disk]] used in the [[American Civil War]] on display in the [[National Cryptologic Museum]]
  • Confederate cipher wheel, captured at the surrender of [[Mobile, Alabama]], in May 1865 – [[National Cryptologic Museum]]
  • Cryptographic slide rule used as a calculation aid by the Swiss Army between 1914 and 1940.
  • The Vigenère square or Vigenère table, also known as the ''[[tabula recta]]'', can be used for encryption and decryption.
SIMPLE TYPE OF POLYALPHABETIC ENCRYPTION SYSTEM
Vigenère Cipher; Le chiffre indéchiffrable; The unbreakable cypher; Le chifffre indechiffrable; Vigenere cipher; Vigenere table; Vigenere Table; Vigenère table; Vigenère Table; Vigenère ciphers; Vigenére cipher; Vigenère square; Vigenere Cipher; Le chiffre indechiffrable; Vigenere square; Vigenere cypher; Vigenere ciphers; Gronsfeld cipher; Vigenère cypher; Kappa test; Vignere cipher; Vigenère's cipher; Bellaso cipher; Bellaso's cipher
матрица шифрования Вижинера
Vigenere cipher         
  • Confederacy]]'s [[cipher disk]] used in the [[American Civil War]] on display in the [[National Cryptologic Museum]]
  • Confederate cipher wheel, captured at the surrender of [[Mobile, Alabama]], in May 1865 – [[National Cryptologic Museum]]
  • Cryptographic slide rule used as a calculation aid by the Swiss Army between 1914 and 1940.
  • The Vigenère square or Vigenère table, also known as the ''[[tabula recta]]'', can be used for encryption and decryption.
SIMPLE TYPE OF POLYALPHABETIC ENCRYPTION SYSTEM
Vigenère Cipher; Le chiffre indéchiffrable; The unbreakable cypher; Le chifffre indechiffrable; Vigenere cipher; Vigenere table; Vigenere Table; Vigenère table; Vigenère Table; Vigenère ciphers; Vigenére cipher; Vigenère square; Vigenere Cipher; Le chiffre indechiffrable; Vigenere square; Vigenere cypher; Vigenere ciphers; Gronsfeld cipher; Vigenère cypher; Kappa test; Vignere cipher; Vigenère's cipher; Bellaso cipher; Bellaso's cipher
шифр Виженера
Caesar cipher         
  • The Caesar cipher is named for [[Julius Caesar]], who used an alphabet where decrypting would shift three letters to the left.
  • A construction of two rotating disks with a Caesar cipher can be used to encrypt or decrypt the code.
  • The distribution of letters in a typical sample of English language text has a distinctive and predictable shape. A Caesar shift "rotates" this distribution, and it is possible to determine the shift by examining the resultant frequency graph.
SIMPLE AND WIDELY KNOWN ENCRYPTION TECHNIQUE
Shift cipher; Caesar shift cipher; Caesar cypher; Caeser cipher; ROT3; Caesar shift; Caesarean cipher; Caesar Cipher; Rotation cipher; Caesar-shift substitution cipher; Caesar encryption; Caesar’s cipher; Caesar Code; Caesar code; Caesar's cipher; Caesar's code; Caesar's Cipher; Caesar Shift; Caesarian cipher; Ceaserian cipher; Ceasarian cipher; Ceserian cipher; Cesarian cipher; Caesar's method; Caesar method; Shift cypher; Ceasar cypher; Ceasar Cipher
шифр Цезаря, шифр подстановки смещением букв алфавита
algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650
<syntaxhighlight lang="text" highlight="1,5">
 1599 = 650×2 + 299
 650 = 299×2 + 52
 299 = 52×5 + 39
 52 = 39×1 + 13
 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
algorithm noun math. алгоритм algorithm validation - проверка правильности алгоритма
rail fence         
TYPE OF TRANSPOSITION CIPHER
Rail fence; Rail-Fence Cipher; Railfence; Railfence cipher; Zigzag cipher; Rail Fence Cipher

['reilfens]

американизм

редкая изгородь из жердей

algorithmic method         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650
<syntaxhighlight lang="text" highlight="1,5">
 1599 = 650×2 + 299
 650 = 299×2 + 52
 299 = 52×5 + 39
 52 = 39×1 + 13
 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

математика

алгоритмический метод

Определение

поток
ПОТ'ОК, потока, ·муж.
1. Стремительно текущая водная масса - река, ручей с сильным течением. Горный поток. Потоки дождя размыли дорогу. "С горы бежит поток проворный." Тютчев.
| перен. О чем-нибудь текущем, исходящем откуда-нибудь в большом количестве. "Всепоглощающий поток сует." Вяземский. Потоки слез поток слов. Поток ругательств.
| перен. Ход, непрерывное движение чего-нибудь (в большом количестве). Поток товаров в деревню. Книжный поток. "Железный поток" (название романа Серафимовича). Живой человеческий поток (идущая толпа, масса).
2. При системе непрерывной производственной практики в вузах - группа учащихся, проходящая курс в то время, как другая подобная группа находится на практике (неол.).
3. Конвейерная система производства; ·срн. поточный
(неол. спец.).
4. перен., твор. ед. потоком, в знач. нареч. Непрерывно, один за другим (спорт.). Прыжки потоком.
На поток и разграбление (отдать что-нибудь) - в полную власть, дающую право беззастенчиво грабить (·первонач. древнерусская мера наказания, лишавшая прав и имущества).

Википедия

Stream cipher

A stream cipher is a symmetric key cipher where plaintext digits are combined with a pseudorandom cipher digit stream (keystream). In a stream cipher, each plaintext digit is encrypted one at a time with the corresponding digit of the keystream, to give a digit of the ciphertext stream. Since encryption of each digit is dependent on the current state of the cipher, it is also known as state cipher. In practice, a digit is typically a bit and the combining operation is an exclusive-or (XOR).

The pseudorandom keystream is typically generated serially from a random seed value using digital shift registers. The seed value serves as the cryptographic key for decrypting the ciphertext stream. Stream ciphers represent a different approach to symmetric encryption from block ciphers. Block ciphers operate on large blocks of digits with a fixed, unvarying transformation. This distinction is not always clear-cut: in some modes of operation, a block cipher primitive is used in such a way that it acts effectively as a stream cipher. Stream ciphers typically execute at a higher speed than block ciphers and have lower hardware complexity. However, stream ciphers can be susceptible to security breaches (see stream cipher attacks); for example, when the same starting state (seed) is used twice.

Как переводится stream cipher algorithm на Русский язык